183 research outputs found

    Dynamic Race Prediction in Linear Time

    Full text link
    Writing reliable concurrent software remains a huge challenge for today's programmers. Programmers rarely reason about their code by explicitly considering different possible inter-leavings of its execution. We consider the problem of detecting data races from individual executions in a sound manner. The classical approach to solving this problem has been to use Lamport's happens-before (HB) relation. Until now HB remains the only approach that runs in linear time. Previous efforts in improving over HB such as causally-precedes (CP) and maximal causal models fall short due to the fact that they are not implementable efficiently and hence have to compromise on their race detecting ability by limiting their techniques to bounded sized fragments of the execution. We present a new relation weak-causally-precedes (WCP) that is provably better than CP in terms of being able to detect more races, while still remaining sound. Moreover it admits a linear time algorithm which works on the entire execution without having to fragment it.Comment: 22 pages, 8 figures, 1 algorithm, 1 tabl

    Special issue on testing, analysis and debugging of concurrent programs

    Get PDF
    This special issue concerns a range of issues related to the development of concurrent programs. This is an important topic, because many systems are now either multi-threaded or distributed, and it is well known that concurrency makes testing, analysis and debugging significantly more complicated. Essentially, the alternative interleavings of events can lead to different behaviours, and so any analysis, debugging or testing technique must consider these interleavings. The interest in this topic is reflected in the larger than normal issue, which contains five papers. The papers fall into three groups: we start with a paper on debugging, then have two on static analysis techniques and finally have two on testing. All papers were reviewed in the normal way

    Screening of respiratory pathogens by Respiratory Multi Well System (MWS) r-geneā„¢ assay in hospitalized patients

    Get PDF
    Novel respiratory viruses have been identified as possible agents of upper and lower respiratory tract infections. Multiplex real-time PCRs have been developed to identify clinically relevant respiratory pathogens. In this study, 178 respiratory samples already screened for influenza virus types A and B by Flu A/B ASR real-time PCR kit were retrospectively analyzed with the Respiratory Multi Well System (MWS) r-geneā„¢ real-time PCR kit which detects a wide spectrum of respiratory pathogens. The goal was to demonstrate the importance of a wide spectrum screening compared to a single diagnostic request. The Flu A/B ASR kit detected influenza B virus in 1.7% of the samples (3/178) and no influenza A virus. The MWS r-geneā„¢ kit detected influenza virus in 6.7% (12/178) of samples (0.6% influenza A, and 6.2% influenza B), while the overall detection rate for respiratory pathogens was 54% (96/178). Co-infections were detected in 8/178 (4.5%) samples. Adenovirus was the infectious agent detected most frequently, followed by respiratory syncytial virus. The risk of being infected by respiratory syncytial virus is almost threefold higher in patients older than 65 years compared to the younger age group (OR:2.7, 95% CI: 1.2-6.2). Wide spectrum screening of respiratory pathogens by real-time PCR is an effective means of detecting clinically relevant viral pathogens

    Gestational age and hospital utilization : three-years follow-up of an area-based birth cohort

    Get PDF
    OBJECTIVE: To investigate differences by gestational age in emergency department visits and re-hospitalizations during the three years following childbirth discharge. METHODS: We performed a historical cohort study in Lazio Region, Italy, for infants born in 2007-2008 to resident mothers. Health administrative data were used. Analysis was performed by multinomial logistic regression. RESULTS: Of 90 545 infants, more than 50% had at least one emergency department visit, and 18.8% at least one re-hospitalization. After the exclusion of infants with congenital anomalies, relative risk ratios of re-hospitalization and, to a lesser extent, of emergency department visits increased by decreasing gestational age; the two events were also higher for mothers ā‰¤35 years of age, with low education and of Italian nationality. Residency outside the metropolitan area was associated with an increased risk of re-hospitalization and a decreased risk of emergency department visits. CONCLUSION: During the three years following childbirth discharge, re-hospitalizations and, to a lesser extent, emergency department use are inversely related to gestational age at birth; socio-demographic factors have an effect on the risk of infant use of hospital resources independent of gestational age

    Morphoanatomical and phytochemical studies for the quality control of Neurolaena lobata (L.) R.Br. ex Cass. (Asteraceae)

    Get PDF
    Neurolaena lobata (L.) R.Br. ex Cass. (Asteraceae)Is a popular folk remedy for in Central America. The plant is of commercial value in Guatemala but so far there is not any monograph to guide regional laboratories on ensuring identity and chemical tests for this species. As identity test we here run macro and micro morphoanatomical studies of the characters of the vegetative organs. We also developed standard chemical tests for quality by both TLC and HPLC for infusions and tinctures of varying alcoholic strength. Their radical scavenging activities in DPPH and NO were also measured. Macro and micro morphoanatomical characters of the vegetative organs present a set of characteristics to facilitate the identification of dry powdered samples of this species. We developed optimal conditions for the TLC and HPLC phytochemical fingerprints of the 4 most common pharmacopoeial liquid herbal preparations from this herbal drug, namely infusion, 70%, 45% and 20% hydroalcoholic tinctures. Our work provides the Latin-American industry with a set of analyses to establish the identity and chemistry of N. lobata samples for quality control purposes. Ā© 2019, Universidad de Santiago de Chile. All rights reserved

    Timed Implementation Relations for the Distributed Test Architecture

    Get PDF
    In order to test systems that have physically distributed interfaces, called ports, we might use a distributed approach in which there is a separate tester at each port. If the testers do not synchronise during testing then we cannot always determine the relative order of events observed at different ports and this leads to new notions of correctness that have been described using corresponding implementation relations. We study the situation in which each tester has a local clock and timestamps its observations. If we know nothing about how the local clocks relate then this does not affect the implementation relation while if the local clocks agree exactly then we can reconstruct the sequence of observations made. In practice, however, we are likely to be between these extremes: the local clocks will not agree exactly but we have some information regarding how they can differ. We start by assuming that a local tester interacts synchronously with the corresponding port of the system under test and then extend this to the case where communications can be asynchronous, considering both the first-in-first-out (FIFO) case and the non-FIFO case. The new implementation relations are stronger than implementation relations for distributed testing that do not use timestamps but still reflect the distributed nature of observations. This paper explores these alternatives and derives corresponding implementation relations

    Generating a checking sequence with a minimum number of reset transitions

    Get PDF
    Given a finite state machine M, a checking sequence is an input sequence that is guaranteed to lead to a failure if the implementation under test is faulty and has no more states than M. There has been much interest in the automated generation of a short checking sequence from a finite state machine. However, such sequences can contain reset transitions whose use can adversely affect both the cost of applying the checking sequence and the effectiveness of the checking sequence. Thus, we sometimes want a checking sequence with a minimum number of reset transitions rather than a shortest checking sequence. This paper describes a new algorithm for generating a checking sequence, based on a distinguishing sequence, that minimises the number of reset transitions used.This work was supported in part by Leverhulme Trust grant number F/00275/D, Testing State Based Systems, Natural Sciences and Engineering Research Council (NSERC) of Canada grant number RGPIN 976, and Engineering and Physical Sciences Research Council grant number GR/R43150, Formal Methods and Testing (FORTEST)
    • ā€¦
    corecore